The Inapproximability for the (0, 1)-additive number
نویسندگان
چکیده
An additive labeling of a graph G is a function l : V (G) → N, such that for every two adjacent vertices v and u of G, ∑
منابع مشابه
Approximability and Inapproximability of Social Welfare Optimization in Multiagent Resource Allocation
Resource allocation is a fundamental problem in the field of multiagent systems, where a set of resources need to be allocated to a group of agents in a way so as to optimizing social welfare. In the last few years this problem has received much attention, especially due to its wide applicability domain (see the survey of Chevaleyre et al. [CDE+06]). This thesis studies the approximability and ...
متن کاملImproved Inapproximability Results for MaxClique, Chromatic Number and Approximate Graph Coloring
In this paper, we present improved inapproximability results for three problems : the problem of finding the maximum clique size in a graph, the problem of finding the chromatic number of a graph, and the problem of coloring a graph with a small chromatic number with a small number of colors. Håstad’s celebrated result [13] shows that the maximum clique size in a graph with n vertices is inappr...
متن کاملA Note on the Inapproximability of Induced Disjoint Paths
We study the inapproximability of the induced disjoint paths problem on an arbitrary n-node m-edge undirected graph, which is to connect the maximum number of the k sourcesink pairs given in the graph via induced disjoint paths. It is known that the problem is NP-hard to approximate within m 1 2 −ε for a general k and any ε > 0. In this paper, we prove that the problem is NP-hard to approximate...
متن کاملReducing the optimum value: FPT inapproximability, for Set Cover and Clique, in time super-exponential in opt
Fixed parameter ρ(k) inapproximability in minimization problems, is given some instance I of a problem with optimum opt, find some k ≥ opt, prove that it is not possible to compute a solution of value ρ(k) · k, usually, under the Exponential Time Hypothesis (eth). If opt is known, inapproximability in terms of opt implies inapproximability in terms of k. An (r, t)-fpt-hardness (in opt) for two ...
متن کاملInapproximability of the Standard Pebble Game and Hard to Pebble Graphs
Pebble games are single-player games on DAGs involving placing and moving pebbles on nodes of the graph according to a certain set of rules. The goal is to pebble a set of target nodes using a minimum number of pebbles. In this paper, we present a possibly simpler proof of the result in [CLNV15] and strengthen the result to show that it is PSPACE-hard to determine the minimum number of pebbles ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics & Theoretical Computer Science
دوره 17 شماره
صفحات -
تاریخ انتشار 2016